منابع مشابه
Baron Munchhausen's Sequence
We investigate a coin-weighing puzzle that appeared in the all-Russian Mathematics Olympiad in 2000. The methods of analysis differ from classical coin-weighing puzzles. We generalize the puzzle by varying the number of participating coins, and deduce a complete solution. Perhaps surprisingly, the objective can be achieved in no more than two weighings regardless of the number of coins involved.
متن کاملAsaf Baron , Isask ' har
Measuring and comparing performance, cost, and other attributes of SpaceWire networks is a significant challenge. A new benchmark for SpaceWire-based satellites is presented. The benchmark contains a potential architecture of a multi-mission satellite, as well as specifications of the traffic flow. The proposed benchmark is demonstrated on an OPNET-based network simulation for various network c...
متن کاملBaron Larrey (1766-1842)
in 1766, three years before Napoleon Bonoparte, whose loving follower Larrey was destined to become. His birthplace was in the romantic region of the High Pyreniees, at the village of Beaudeau. At the period of Larrey's birth, centuries of misrule were about to culminate in a mighty catastrophe for Franice. At the beginning of the eighteenth century, France was the most powerful nation in Europ...
متن کاملBaron Munchhausen's lung function expertise
A young anorectic woman suffering from asthma since her early childhood exacerbated without obvious cause and did not respond to treatment. Body plethysmography showed an isolated huge increase of the expiratory resistance. During inspiration, resistance was not elevated. However, in 1 out of 3 successive manoeuvres, expiratory resistance was completely normal. We believe this to be a Munchhaus...
متن کاملBaron Münchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle
We investigate a coin-weighing puzzle that appeared in the 1991 Moscow Math Olympiad. We generalize the puzzle by varying the number of participating coins, and deduce an upper bound on the number of weighings needed to solve the puzzle that is noticeably better than the trivial upper bound. In particular, we show that logarithmically-many weighings on a balance suffice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Books at Iowa
سال: 1964
ISSN: 0006-7474,2378-4830
DOI: 10.17077/0006-7474.1005